-
1 empty subset
Математика: пустое подмножество -
2 empty subset
мат. -
3 non-empty subset
Большой англо-русский и русско-английский словарь > non-empty subset
-
4 non-empty subset
-
5 non-empty subset
Математика: непустое подмножество -
6 non-empty subset
непустое подмножествоEnglish-Russian dictionary of technical terms > non-empty subset
-
7 non-empty subset
-
8 subset
1) телефон. абонентский аппарат2) подгруппа3) подкласс4) подмножество5) полукомплект•- almost open subset - almost unitary subset - bounded below subset - countably paracompact subset - everywhere dense subset - linearly independent subset - locally closed subset - locally polyhedral subset - locally tame subset - nonvoid subset - polynomially convex subset - potentially invertible subset - relatively compact subset - relatively pseudocompact subset - right perfect subset - right unitary subset - strongly dependent subset - strongly positive subset - totally ordered subset - uniformly integrable subset - universally measurable subset - weakly bounded subset - weakly closed subset - weakly invariant subset - weak-star closed subset - well ordered subset - well separated subset -
9 subset
1) подмножество
2) полукомплект
3) аппарат абонентский
4) аппарат телефонный абонентский
5) подкласс
6) подсовокупность
7) подгруппа
8) сокращенный вариант
– imprimitive subset
– non-empty subset
– proper subset
– receiver subset
– transmitter subset -
10 non-empty
матем. непустой - non-empty subsetБольшой англо-русский и русско-английский словарь > non-empty
-
11 non-empty
-
12 непустое подмножество
Большой англо-русский и русско-английский словарь > непустое подмножество
-
13 пустое подмножество
Большой англо-русский и русско-английский словарь > пустое подмножество
-
14 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
Empty function — In mathematics, an empty function is a function whose domain is the empty set. For each set A , there is exactly one such empty function :f A: varnothing ightarrow A.The graph of an empty function is a subset of the Cartesian product empty;… … Wikipedia
Empty set — ∅ redirects here. For similar looking symbols, see Ø (disambiguation). The empty set is the set containing no elements. In mathematics, and more specifically set theory, the empty set is the unique set having no elements; its size or cardinality… … Wikipedia
Subset — In mathematics, especially in set theory, a set A is a subset of a set B if A is contained inside B . Notice that A and B may coincide. The relationship of one set being a subset of another is called inclusion.DefinitionsIf A and B are sets and… … Wikipedia
Axiom of empty set — In set theory, the axiom of empty set is one of the axioms of Zermelo–Fraenkel set theory and one of the axioms of Kripke–Platek set theory. Formal statement In the formal language of the Zermelo–Fraenkel axioms, the axiom reads::exist x, forall… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Closure (topology) — For other uses, see Closure (disambiguation). In mathematics, the closure of a subset S in a topological space consists of all points in S plus the limit points of S. Intuitively, these are all the points that are near S. A point which is in the… … Wikipedia
Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Filter (mathematics) — The powerset algebra of the set {1,2,3,4} with the upset colored green. The green elements make a principal ultrafilter on the lattice. In mathematics, a filter is a special subset of a partially ordered set. A frequently used special case is the … Wikipedia
Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… … Wikipedia